Installation of Java

Writing your First Program

Variables & Data Types

Reading User Inputs

Operators and Expressions

Math API

Conditional Statements

Loops & Coding Problems

Branching Statements

Pattern Programming

Deep Dive into Arrays

Methods & Arguments

Multidimensional Arrays

Class and Object

Constructor & Overloading

Polymorphism

Strings & StringBuilder

Wrapper Classes Overview

BufferedReader API

JDK, JRE, and JVM

Encapsulation

Static Keyword

Inheritance

Method Overriding

Access Modifiers

Abstract Class & Interface

Exception Handling

Time & Space Complexity

Collections Framework

Bit Manipulation

Garbage Collection

Recursion Level 1

Advanced Maths

Dynamic Arrays

Sorting Algorithms

Binary Search

Hashmaps & HashSets

Matrix Operations

More on Strings

Implementation & Operations

Level 1 Problems

Level 2 Problems

Level 3 Problems

Stack Implementation

Queue Implementation

Level 1 Problems

Level 2 Problems

Level 3 Problems

Backtracking Concepts

Level 2 Problems

Level 3 Problems

Level 4 Problems

Level 5 Problems

Implementation of Binary Trees

Level 1 Problems

Level 2 Problems

Level 3 Problems

Level 4 Problems

Binary Search Trees

Level 1 Problems

Level 2 Problems

Implementation & Operations

Priority Queue

Comaparator Interface

Level 1 Problems

Level 2 Problems

Implementation of Graphs

DFS & BFS

Cycle Detection

Kahn's Algorithm

Topological Sort

Dijkstra's Algorithm

Bellman Ford Algorithm

Minimum Spanning Tree

Prim's Algorithm

Disjoint Set Union

Path Compression

Kruskal's Algorithm

Identifications

Level 1 Problems

Level 2 Problems

Understanding DP

Level 1 - Fibonacci

Level 2 - 0/1 Knapsack

Level 3 - Unbounded Knapsack

Level 4 - Longest Common Subsequence

Level 5 - Palindromic Subsequence

Level 6 - Matrix Chain Multiplication

Level 7 - Longest Increasing Subsequence

Implementation of Trie

Level 1 Problems

Level 2 Problems

Implementation

Level 1 Problems

Level 2 Problems